Complexity of Cylindrical Decompositions of Sub-pfaffian Sets
نویسنده
چکیده
We construct an algorithm for a cylindrical cell decomposition of a closed cube In ⊂ Rn compatible with a “restricted” sub-Pfaffian subset Y ⊂ In, provided an oracle deciding consistency of a system of Pfaffian equations and inequalities is given. In particular, the algorithm produces the complement Ỹ = In \Y . The complexity bound of the algorithm, the number and formats of cells are doubly exponential in n3.
منابع مشابه
Complexity of Computations with Pfaffian and Noetherian Functions
This paper is a survey of the upper bounds on the complexity of basic algebraic and geometric operations with Pfaffian and Noetherian functions, and with sets definable by these functions. Among other results, we consider bounds on Betti numbers of sub-Pfaffian sets, multiplicities of Pfaffian intersections, effective Lojasiewicz inequality for Pfaffian functions, computing frontier and closure...
متن کاملCylindrical Algebraic Sub-Decompositions
Cylindrical Algebraic Decompositions (CADs) have been studied since their creation as a tool for working with semi-algebraic sets and eliminating quantifiers of the reals. In this paper we are concerned with Cylindrical Algebraic Sub-Decompositions (sub-CADs), defined as subsets of CADs sufficient to describe the solutions for given formulae. We discuss several ways to construct sub-CADs, both ...
متن کاملThe Theorem of the Complement for Nested Sub-pfaffian Sets
Let R be an o-minimal expansion of the real field, and let Lnest(R) be the language consisting of all nested Rolle leaves over R. We call a set nested sub-pfaffian over R if it is the projection of a boolean combination of definable sets and nested Rolle leaves over R. Assuming that R admits analytic cell decomposition, we prove that the complement of a nested sub-pfaffian set over R is again a...
متن کاملRelative Closure and the Complexity of Pfaffian Elimination
We introduce the “relative closure” operation on one-parametric families of semi-Pfaffian sets. We show that finite unions of sets obtained with this operation (“limit sets”) constitute a structure, i.e., a Boolean algebra closed under projections. Any Pfaffian expression, i.e., an expression with Boolean operations, quantifiers, equations and inequalities between Pfaffian functions, defines a ...
متن کاملFrontier and Closure of a Semi-Pfaffian Set
For a semi-Pfaffian set, i.e., a real semianalytic set defined by equations and inequalities between Pfaffian functions in an open domain G, the frontier and closure in G are represented as semi-Pfaffian sets. The complexity of this representation is estimated in terms of the complexity of the original set. Introduction. Pfaffian functions introduced by Khovanskii [K] are analytic functions sat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999